A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems
نویسندگان
چکیده
منابع مشابه
Scheduling a variant of flowshop problems to minimize total tardiness
This paper studies no-wait flowshop scheduling problems to minimize total tardiness. This paper mathematically formulates the problem as an effective mixed integer linear programming model. Moreover, this paper proposes solution methods based on variable neighborhood search and simulated annealing algorithms. Besides, some well-known heuristics of classical flow shops are adapted to the case of...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملGene algorithm for generalized tardiness flowshop problems
In this paper a generalized version of the tardiness flowshop permutation scheduling problems is considered. A mathematical programming formulation, in the form of a combinatorial optimization model, is also developed. Then a genetic algorithm is developed for solving the proposed problem. The efficiency of the developed algorithm is evaluated through a computational experiment, in which severa...
متن کاملBounds for the permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness
We consider the problem of n-jobs scheduling in an m-machine permutation flowshop with exact time lags between consecutive operations of each job. The exact time lag is defined as the time elapsed between every couple of successive operations of the same job which is equal to a prescribed value. The aim is to find a feasible schedule that minimizes the total tardiness and earliness. We propose ...
متن کاملAn improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Entrepreneurship, Management and Innovation
سال: 2012
ISSN: 2299-7075,2299-7326
DOI: 10.7341/2012822